#include <bits/stdc++.h>
using namespace std;

#define int int64_t
#define endl "\n"

using PII = pair<int, int>;
using TII = tuple<int, int, int>;
template<class T>
using V = vector<T>;
using i64 = long long;
using i128 = __int128;
using u64 = unsigned long long;

#define FOR(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define FOR2(i, a, b, c) for (int i = (int)(a); i <= (int)(b); i += c)
#define FORD(i, b, a) for (int i = (int)(a); i >= (int)(b); i--)
#define FORD2(i, b, a, c) for (int i = (int)(a); i >= (int)(b); i -= c)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define lowbit(x) ((x)&(-x))
#define RE return;
#define Yes cout << "Yes" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define NO cout << "NO" << endl;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define sz size()

V<int>b;

void init(){
    FOR(i, 1, 1e4){
        if (i * i > 1e6){
            break;
        }
        b.eb(i * i);
    }
}

void solve() {
    int n;
    cin >> n;
    V<int>ans(n, 0);

    int x = n - 1;

    while (x > 0){
        int t = *lower_bound(ALL(b), x);
        int cnt = 0;
        FORD(i, 0, x){
            if (t - i <= x){
                ans[i] = t - i;
                cnt++;
            } else{
                break;
            }
        }
        x -= cnt;
    }
    FOR(i, 0, n - 1)cout << ans[i] << " ";
    cout << endl;
}

signed main() {
    int Task = 1;

    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> Task;
    init();
    while (Task--) {
        solve();
    }

    return 0;
}